Common Computational Frameworks as Benchmarking Platforms

نویسندگان

  • John Shalf
  • Erik Schnetter
  • Gabrielle Allen
  • Edward Seidel
چکیده

Computational Frameworks, supporting multiple algorithms and applications with common parallel, I/O, and other computational routines, can provide an excellent substrate for application-scale benchmarks. Such benchmarks are essential for estimating the effective performance of HPC systems for the purpose of system procurements. Cactus is extremely portable and its modularity supports a variety of communication substrates and numerical methods — offering wide-coverage of the HPC applications domain.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Cross-Layer Multi-Cloud Real-Time Application QoS Monitoring and Benchmarking As-a-Service Framework

Cloud computing provides on-demand access to affordable hardware (e.g., multi-core CPUs, GPUs, disks, and networking equipment) and software (e.g., databases, application servers and data processing frameworks) platforms with features such as elasticity, pay-per-use, low upfront investment and low time to market. This has led to the proliferation of business critical applications that leverage ...

متن کامل

CHO: A Benchmark Suite for OpenCL-based FPGA Accelerators

Programming FPGAs with OpenCL-based high-level synthesis frameworks is gaining attention with a number of commercial and research frameworks announced. However, there are no benchmarks for evaluating these frameworks. To this end, we present CHO benchmark suite an extension of CHStone, a commonly used C-based high-level synthesis benchmark suite, for OpenCL. We characterise CHO at various level...

متن کامل

A Generalization of Initial Conditions in Benchmarking of Economic Time-Series by Additive and Proportional Denton Methods

The paper presents unified analytical solution for combining high-frequency and low-frequency economic time-series by additive and proportional Denton methods with parametrical dependence on the initial values of variable and indicator in evident form. This solution spans Denton’s original and Cholette’s advanced benchmarking initial conditions as the subcases. Computational complexity of the o...

متن کامل

Benchmarking of dynamic simulation predictions in two software platforms using an upper limb musculoskeletal model.

Several opensource or commercially available software platforms are widely used to develop dynamic simulations of movement. While computational approaches are conceptually similar across platforms, technical differences in implementation may influence output. We present a new upper limb dynamic model as a tool to evaluate potential differences in predictive behavior between platforms. We evalua...

متن کامل

gpALIGNER: A Fast Algorithm for Global Pairwise Alignment of DNA Sequences

Bioinformatics, through the sequencing of the full genomes for many species, is increasingly relying on efficient global alignment tools exhibiting both high sensitivity and specificity. Many computational algorithms have been applied for solving the sequence alignment problem. Dynamic programming, statistical methods, approximation and heuristic algorithms are the most common methods appli...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2006